Solving a multi-objective interval crew-scheduling problem via Genetic Algorithms

In this paper, a crew-scheduling problem has been formulated considering the daily assignment of a set of crew staff to their round-trips for all the public transports (e.g. train, bus or air bus) that will minimize the waiting times and total service times (including waiting times) of all crews separately. In this approach, the waiting times as well as the service times of crews have been taken as intervals. Here the problem has been formulated as a multi-objective assignment problem using interval arithmetic and the order relations (for the case of pessimistic decision making) that represent the decision maker’s preference between interval times. For this purpose, we have used the existing complete definition of order relations recently developed. Finally, the reformulated problem has been converted to a single objective optimization problem using Global Criterion Method and then solved the same by tournament genetic algorithm. The experimental results of the proposed approach to a crew-scheduling problem have been reported.